1 4 Ju n 20 06 EXPONENTIAL BAKER - CAMPBELL - HAUSDORFF FORMULA AND APPLICATIONS TO FORMAL VECTOR FIELDS
نویسنده
چکیده
The classical Baker-Campbell-Hausdorff formula gives a recursive way to compute the Hausdorff series H = log(e X e Y) for non-commuting X, Y. Formally H lives in a completionˆL of the free Lie algebra L generated by X, Y. We prove that there are F, G ∈ [ ˆ L, ˆ L] such that H = e F Xe −F + e G Y e −G. We give a closed expression for H in the Lie algebra of formal vector fields on the line.
منابع مشابه
An algorithm for the Baker-Campbell-Hausdorff formula
A simple algorithm, which exploits the associativity of the BCH formula, and that can be generalized by iteration, extends the remarkable simplification of the BakerCampbell-Hausdorff (BCH) formula, recently derived by Van-Brunt and Visser. We show that if [X,Y ] = uX + vY + cI, [Y, Z] = wY + zZ + dI, and, consistently with the Jacobi identity, [X,Z] = mX + nY + pZ + eI, then exp(X) exp(Y ) exp...
متن کاملBayesian Fusion on Lie Groups
An increasing number of real-world problems involve the measurement of data, and the computation of estimates, on Lie groups. Moreover, establishing confidence in the resulting estimates is important. This paper therefore seeks to contribute to a larger theoretical framework that generalizes classical multivariate statistical analysis from Euclidean space to the setting of Lie groups. The parti...
متن کاملSelf-adjoint operators and solving the Schrödinger equation
In this tutorial we collect facts from the theory of self-adjoint operators, mostly with a view of what is relevant for applications in mathematical quantum mechanics, in particular for solving the Schrödinger equation. Specific topics include the spectral theorem and functional calculus for self-adjoint operators, Stone’s Theorem, Laplacians and Fourier transform, Duhamel’s formula and Dyson s...
متن کاملApplications of Lie Methods to Computations with Polycyclic Groups
In this thesis we demonstrate the algorithmic usefulness of the so-called Mal’cev correspondence for computations with infinite polycyclic groups. This correspondence between Q-powered nilpotent groups and rational nilpotent Lie algebras was discovered by Anatoly Mal’cev in 1951. We show how the Mal’cev correspondence can be realized on a computer. We explore two possibilities for this purpose ...
متن کاملExponential sums over finite fields, II: introduction to cohomological methods
Contents Chapter 1. Introduction 1 1. Why is the one-variable theory not sufficient? 1 2. Outline of the rest of the book 1 Chapter 2. Background material: algebraic geometry 3 1. Affine algebraic varieties 3 2. First examples 7 3. Computing with algebraic varieties 7 Chapter 3. Summands for algebraic exponential sums 8 1. From Dirichlet characters to Galois characters 8 2. From Galois groups t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006